Module #6 : Channel Coding

Module #6 : Channel Coding

Module #6 : Channel Coding

ar X iv : 0 80 6 . 42 64 v 1 [ cs . I T ] 2 6 Ju n 20 08 Online network coding for optimal throughput and delay – the two - receiver case Jay

For a packet erasure broadcast channel with two receivers, a new coding algorithm is proposed that makes use of feedback to achieve asymptotically optimal queue size at the sender and decoding delay at the receivers, without compromising on throughput. Our coding module is compatible with the drop-when-seen queuing algorithm proposed in earlier work [1]. Hence, it guarantees that the physical q...

Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel

In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...

An efficient secure channel coding scheme based on polar codes

In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...